Efficient solution of linear matrix equations with application to multistatic antenna array processing
نویسندگان
چکیده
منابع مشابه
Efficient Solution of Linear Matrix Equations with Application to Multistatic Antenna Array Processing
We present a computationally-efficient matrix-vector expression for the solution of a matrix linear least squares problem that arises in multistatic antenna array processing. Our derivation relies on an explicit new relation between Kronecker, Khatri-Rao and Schur-Hadamard matrix products, which involves a selection matrix (i.e., a subset of the columns of a permutation matrix). Moreover, we sh...
متن کاملNew solution of fuzzy linear matrix equations
In this paper, a new method based on parametric form for approximate solu-tion of fuzzy linear matrix equations (FLMEs) of the form AX = B; where Ais a crisp matrix, B is a fuzzy number matrix and the unknown matrix X one,is presented. Then a numerical example is presented to illustrate the proposedmodel.
متن کاملnew solution of fuzzy linear matrix equations
in this paper, a new method based on parametric form for approximate solu-tion of fuzzy linear matrix equations (flmes) of the form ax = b; where ais a crisp matrix, b is a fuzzy number matrix and the unknown matrix x one,is presented. then a numerical example is presented to illustrate the proposedmodel.
متن کاملDigitally Excited Reconfigurable Linear Antenna Array Using Swarm Optimization Algorithms
This paper describes the synthesis of digitally excited pencil/flat top dual beams simultaneously in a linear antenna array constructed of isotropic elements. The objective is to generate a pencil/flat top beam pair using the excitations generated by the evolutionary algorithms. Both the beams share common variable discrete amplitude excitations and differ in variable discrete phase excitations...
متن کاملEfficient Solution of Large Sparse Linear Equations
Algebraic attacks is a powerful type of attacks against LFSR-based stream ciphers. Solving large sparse linear equations Ax = b is needed for this attack. The traditional Gaussian elimination is not efficient for such matrix equations because of its cube run time complexity. Quadratic run time algorithms like Lanczos or Wiedemann Methods are the better for such large sparse matrices. We impleme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Information and Systems
سال: 2005
ISSN: 1526-7555,2163-4548
DOI: 10.4310/cis.2005.v5.n1.a5